Computational Complexity of Some Maximum Average Weight Problems with Precedence Constraints
نویسندگان
چکیده
منابع مشابه
Computational Complexity of Some Equivalence-Checking Problems
This habilitation thesis gives an overview of five papers of the author in the area of verification, in particular, in the study of computational complexity of equivalence checking problems and related areas. The first of these papers, Sawa, Jančar: Equivalences on Finite-State Systems are PTIME-hard (2005), shows that deciding any relation between bisimulation equivalence (bisimilarity) and tr...
متن کاملOn the Average Case Complexity of Some P-complete Problems
We show that some classical P-complete problems can be solved efficiently in average NC. The probabilistic model we consider is the sample space of input descriptions of the problem with the underlying distribution being the uniform one. We present parallel algorithms that use a polynomial number of processors and have expected time upper bounded by (eIn4 + o(l))logn, asymptotically with high p...
متن کاملAverage-case complexity of Maximum Weight Independent Set with random weights in bounded degree graphs
Finding the largest independent set in a graph is a notoriously difficult NP -complete combinatorial optimization problem. Unlike other NP-complete problems, it does not admit a constant factor approximation algorithm for general graphs. Furthermore, even for graphs with largest degree 3, no polynomial time approximation algorithm exists with a 1.0071-factor approximation guarantee. We consider...
متن کاملSingle Machine Scheduling Problem with Precedence Constraints and Deteriorating Jobs
This paper considers the single machine scheduling problem with precedence constraints and deteriorating jobs. A mathematical model based on binary integer programming (BIP) is developed. By these precedence constraints, jobs can not start before completion of its all predecessors. The represented model is in two steps, in step one the earliest starting time of each job is computed, then the re...
متن کاملReoptimization of Some Maximum Weight Induced Hereditary Subgraph Problems
The reoptimization issue studied in this paper can be described as follows: given aninstance I of some problem Π, an optimal solution OPT for Π in I and an instance I ′ resultingfrom a local perturbation of I that consists of insertions or removals of a small number ofdata, we wish to use OPT in order to solve Π in I , either optimally or by guaranteeingan approximation ratio be...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research
سال: 1994
ISSN: 0030-364X,1526-5463
DOI: 10.1287/opre.42.4.688